Area-Time Complexity for VLSI
نویسنده
چکیده
495 The complexity of the Discrete Fourier Transform (OFT) is studied with respect to a new model of computation appropriate to VLSI technology. This model focuses on two key parameters, the amount of silicon area and time required to implement a OFT on a single chip. Lower bounds on area (A) and time (T) are related to the number of points (N) in the OFT: AT2 > N2/16. This inequality holds for any chip design based on any algorithm, and is nearly tight when T • e<Nl/2) or T • 9(1og N).
منابع مشابه
Low Complexity Converter for the Moduli Set {2^n+1,2^n-1,2^n} in Two-Part Residue Number System
Residue Number System is a kind of numerical systems that uses the remainder of division in several different moduli. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers will increase the speed of the arithmetic operations in this system. However, the main factor that affects performance of system is hardware complexity of reverse converter. Reverse co...
متن کاملEfficient VLSI Architectures for Multiuser Channel Estimation in Wireless Base-Station Receivers
This paper presents a reduced-complexity, fixed-point algorithm and efficient real-time VLSI architectures for multiuser channel estimation, one of the core baseband processing operations in wireless base-station receivers for CDMA. Future wireless base-station receivers will need to use sophisticated algorithms to support extremely high data rates and multimedia. Current DSP implementations of...
متن کاملCarnegie - Mellon University A Complexity Theory for VLSI
The established methodologies for studying computational complexity can be applied to the new problems posed by very large-scale integrated (VLSI) circuits. This thesis develops a “VLsI model of computation” and derives upper and lower bounds on the silicon area and time required to solve the problems of sorting and discrete Fourier transformation. In particular, the area A and time T taken by ...
متن کاملThe Area-Time Complexity of the VLSI Counter
This paper is a modification of a result of Codenotti and Lotti [2]. They studied the area-time complexity of an n-bit VLSI counter in the synchronous VLSI model (see [1]). They proved a lower bound AT 2= fl(n log n) and proposed a circuit of complexity AT 2-O(n log4n). This circuit satisfied the property that all I / O ports lay on the border of the circuit. Henceforth, we shall call the synch...
متن کاملOn the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
Abstmct-This paper presents lower bound results on Boolean function complexity under two different models. The first is an abstraction of tradeoffs between chip area and speed in very large scale integrated (VLSI) circuits. The second is the ordered binary decision diagram (OBDD) representation used as a data structure for symbolically representing and manipulating Boolean functions. These lowe...
متن کامل